import _00GraphFuc as gf
import _000GraphBasicProblem as gb

#11.3.2生成m*n图，求最短路径
m,n=5,6
[V,E0]=gf.MNgraph(m,n)
gf.drawgraph(E0)
[V,Ew]=gf.weightedgraph(V,E0,100)
v0,vn=0,m*n-1
[Hx,path]=gb.shortestpath(V,Ew,v0,vn)
print(Ew)
print(Hx)
print(sorted(path))